Removing Redundant Messages in N-ary BnB-ADOPT
نویسندگان
چکیده
منابع مشابه
Removing Redundant Messages in N-ary BnB-ADOPT
This note considers how to modify BnB-ADOPT, a well-known algorithm for optimally solving distributed constraint optimization problems, with a double aim: (i) to avoid sending most of the redundant messages and (ii) to handle cost functions of any arity. Some of the messages exchanged by BnB-ADOPT turned out to be redundant. Removing most of the redundant messages increases substantially commun...
متن کاملSaving Redundant Messages in BnB-ADOPT
We have found that some messages of BnB-ADOPT are redundant. Removing most of those redundant messages we obtain BnB-ADOPT, which achieves the optimal solution and terminates. In practice, BnBADOPT causes substantial reductions on communication costs with respect to the original algorithm. BnB-ADOPT (Yeoh, Felner, and Koenig 2008) is a reference algorithm for distributed constraint optimization...
متن کاملGeneralizing ADOPT and BnB-ADOPT
ADOPT and BnB-ADOPT are two optimal DCOP search algorithms that are similar except for their search strategies: the former uses best-first search and the latter uses depth-first branch-and-bound search. In this paper, we present a new algorithm, called ADOPT(k), that generalizes them. Its behavior depends on the k parameter. It behaves like ADOPT when k = 1, like BnB-ADOPT when k = ∞ and like a...
متن کاملImproving BnB-ADOPT+-AC
Several multiagent tasks can be formulated and solved as DCOPs. BnB-ADOPT-AC is one of the most efficient algorithms for optimal DCOP solving. It is based on BnBADOPT, removing redundant messages and maintaining soft arc consistency during search. In this paper, we present several improvements for this algorithm, namely (i) a better implementation, (ii) processing exactly simultaneous deletions...
متن کاملBnB-ADOPT+ with Several Soft AC Levels
Distributed constraint optimization problems can be solved by BnBADOPT$^+$, a distributed asynchronous search algorithm. In the centralized case, local consistency techniques applied to constraint optimization have been shown very beneficial to increase performance. In this paper, we combine BnB-ADOPT$^+$ with different levels of soft arc consistency, propagating unconditional deletions caused ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2012
ISSN: 1076-9757
DOI: 10.1613/jair.3696